منابع مشابه
Reductions to Sets of Low Information Content
In this paper we study the complexity of sets that reduce to sparse sets (and tally sets), and the complexity of the simplest sparse sets to which such sets reduce. We show even with respect to very exible reductions that NP cannot have sparse hard sets unless P = NP; an immediate consequence of our results is: If any NP-complete set conjunctively reduces to a sparse set, then P = NP. We also s...
متن کاملOn Self-Reducible Sets of Low Information Content
Self-reducible sets have a rich internal structure. The information contained in these sets is encoded in some redundant way. Therefore a lot of the information of the set is easily accessible. In this paper it is investigated how this self-reducibility structure of a set can be used to access easily all information contained in the set, if its information content is small. It is shown that P c...
متن کاملReductions to Sets of Low Information Content (extended Abstract)
*Department of Computer Science and Engineering, Indian Institute of Technology, DeLhi, New Delhi 110016, India. Work done while visiting Unlversit~/t Ulm. Supported in part by an Alexander von Humboldt postdoctoral research fellowship. IDepartment of Computer Science, University of Rochester, Rochester, NY 14627, USA. Supported in part by the National Science Foundation under research grant CC...
متن کاملOn the reducibility of sets inside NP to sets with low information content
We study whether sets inside NP can be reduced to sets with low information content but possibly still high computational complexity. Examples of sets with low information content are tally sets, sparse sets, P-selective sets and membership comparable sets. For the graph automorphism and isomorphism problems GA and GI, for the directed graph reachability problem GAP, for the determinant functio...
متن کاملInformation content of sets of biological sequences revisited
To analyze the information included in a pool of amino-acid sequences, a first approach is to align the sequences, to estimate the probability of each amino-acid to occur within columns of the aligned sequences and to combine these values through an ”entropy” function whose minimum corresponds to absence of information, that is to the case where each amino-acid has the same probability to occur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1996
ISSN: 0304-3975
DOI: 10.1016/0304-3975(95)00073-9